constraint networks

См. также в других словарях:

• Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… …   Wikipedia

• Constraint satisfaction — In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a vector of variables that… …   Wikipedia

• Constraint-based Routing Label Distribution Protocol — (CR LDP) is a control protocol used in some computer networks. As of February 2003, the IETF MPLS working group deprecated CR LDP and decided to focus purely on RSVP TE. It is an extension of the Label Distribution Protocol (LDP), one of the… …   Wikipedia

• Location estimation in sensor networks — Location estimation in wireless sensor networks is the problem of estimating the location of an object from a set of noisy measurements, when the measurements are acquired in a distributedmanner by a set of sensors.MotivationIn many civilian and… …   Wikipedia

• Confabulation (neural networks) — A confabulation, also known as a false, degraded, or corrupted memory, is a stable pattern of activation in a neural network or neural assembly that does not correspond to any previously learned patterns. The same term is also applied to the… …   Wikipedia

• Key distribution in wireless sensor networks — Key distribution is an important issue in WSN design. It is a newly developing field due to the recent improvements in wireless communications.Wireless sensor networks are networks of small, battery powered, memory constraint devices named sensor …   Wikipedia

• Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… …   Wikipedia

• Problème de satisfaction de contrainte — Problème de satisfaction de contraintes Les problèmes de satisfaction de contrainte ou CSP (Constraint Satisfaction Problem) sont des problèmes mathématiques où l on cherche des états ou des objets satisfaisant un certain nombre de contraintes ou …   Wikipédia en Français

• Problème de satisfaction de contraintes — Les problèmes de satisfaction de contraintes ou CSP (Constraint Satisfaction Problem) sont des problèmes mathématiques où l on cherche des états ou des objets satisfaisant un certain nombre de contraintes ou de critères. Les CSP font l objet de… …   Wikipédia en Français

• Multi-paradigm programming language — A multi paradigm programming language is a programming language that supports more than one programming paradigm. As Leda designer Tim Budd holds it: The idea of a multiparadigm language is to provide a framework in which programmers can work in… …   Wikipedia

• Loop quantum gravity — Not to be confused with the path integral formulation of LQG, see spin foam. This article is about LQG in its Canonical formulation.. Beyond the Standard Model …   Wikipedia